Claude Berge and the “ Oulipo ”

نویسندگان

  • Denis Bouyssou
  • Dominique de Werra
  • Olivier Hudry
چکیده

is well-known in the Operational Research community for his path-breaking contributions to graph theory. He received several awards for his scientific achievements, including the EURO Gold Medal (1989) and the Euler Prize (1995, jointly with R.L. Graham). The name of Claude Berge is likely to remain in history for several other reasons. For instance he was an expert in the Asmat art from New-Guinea. He was himself a famous sculptor. We would like here to mention yet another facet of Claude Berge. He was a founding member of Oulipo (for " OUvroir de LIttérature POtentielle " , i.e., " workroom of potential literature "). This group was created on 24 November 1960 under the impulsion of Raymond Queneau and François Le Lionnais (the other founding members were Albert-they were joined later by several well-known members including Italo Calvino, Harry Mattews, Georges Perec and Jacques Roubaud). Oulipo was a group of writers and mathematicians aiming at exploring in a systematic way formal constraints on the production of literary texts. Although poets had explored for years the formal constraints of versification, the originality of the group was to develop new or rarely studied constraints and to explore them systematically. With this objective in mind, the collaboration between writers and mathematicians proved extremely useful and Oulipo is considered to be among the most influential literary groups in France in the twentieth century. The group is still active today. According to the rules of the group, Claude Berge will be " excusé pour cause de décès " at each meeting of Oulipo. It is impossible here to give a complete overview of the incredible variety of constraints that the members of the group have explored and are still exploring. It is nevertheless quite certain that Claude Berge has participated in the development and study of many of them besides producing his own texts. Georges Perec was perhaps one of the most talented and prolific member of Oulipo. In his book La Vie, mode d'emploi [12], Perec tells a story happening in a building of ten floors with ten rooms in each floor, based on the rather recent (at that time) discovery of orthogonal Latin squares of size 10: it is a 10 by 10 array in each entry of which we have one of the numbers 1 to 10 and one letter a, b, c, ..., h, i, j; these are arranged in such …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Claude Berge: 5.6.1926-30.6.2002

The departure of Claude Berge leaves a painful void in many of our lives. He enchanted people around him with his multiple talents, his great erudition in diverse domains, his sense of humour, his modesty, his love of life. Although primarily a combinatorist, Berge made a lasting mark on other subjects with his early mathematical work. His treatise on game theory [2] introduced an alternative t...

متن کامل

Combinatorics: from Oulipo to Recombinant Poetics

RECOMBINANT POETICS Interaction with different forms of generative production enables one to dynamically explore emergent meaning. New forms of computer-based art can make it possible for participants to actively become engaged in aspects of the production of the work. Each “user” of a specifically authored computer-mediated system may have a quite different experience emerging through interact...

متن کامل

Perfect graphs: a survey

Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002, and is now called the strong perfect graph theorem. This is a survey about perfect graphs, mostly focused on the strong perfect gr...

متن کامل

Berge Sorting Dedicated to Professor Masakazu Kojima on the occasion of his 60th birthday

In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of ⌈n 2 ⌉ white pegs followed immediately by ⌊n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Avis and D...

متن کامل

On the generalized Berge sorting conjecture

In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs, rearrange the pegs into a string consisting of ⌈n 2 ⌉ white pegs followed immediately by ⌊n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Berge’s original question was generalized by considering the same sorting problem usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006